A Finite - Di erence Algorithm for the TravelingSalesman
نویسندگان
چکیده
We develop an algorithm for the traveling salesman problem by applying nite diierences to a generating function. This algorithm requires polynomial space. In comparison, a dynamic programming algorithm requires exponential space. Also, the nite-diierence algorithm requires less space than a similar inclusion and exclusion algorithm.
منابع مشابه
Orr Sommerfeld Solver Using Mapped Finite Di?erence Scheme for Plane Wake Flow
Linear stability analysis of the three dimensional plane wake flow is performed using a mapped finite di?erence scheme in a domain which is doubly infinite in the cross–stream direction of wake flow. The physical domain in cross–stream direction is mapped to the computational domain using a cotangent mapping of the form y = ?cot(??). The Squire transformation [2], proposed by Squire, is also us...
متن کاملImplementation of a Finite Di erence Method on a Custom Computing Platform
The nite di erence method is a numerical analysis technique used to solve problems involving irregular geometries, complicated boundary conditions, or both. The geometries are represented using partial di erential equations. The solutions to the partial di erential equations can be easily generated with the aid of a computer. As the geometries become increasingly complex, the solutions of the p...
متن کاملThe completely conservative di erence schemes for the nonlinear Landau – Fokker – Planck equation
Conservativity and complete conservativity of nite di erence schemes are considered in connection with the nonlinear kinetic Landau–Fokker–Planck equation. The characteristic feature of this equation is the presence of several conservation laws. Finite di erence schemes, preserving density and energy are constructed for the equation in oneand two-dimensional velocity spaces. Some general method...
متن کاملOn the Complexity of Recognizing Iterated Differences of Polyhedra on the Complexity of Recognizing Iterated Differences of Polyhedra
The iterated di erence of polyhedra V P n P n Pk has been proposed independently in and as a su cient condition for V to be exactly computable by a two layered neural network An algorithm checking whether V IR is an iterated di erence of polyhedra is proposed in However this algorithm is not practically usable because it has a high computational complexity and it was only conjectured to stop wi...
متن کاملTheoretical Analysis of Finite Difference Algorithms for Linear Shape from Shading
This paper presents and analyzes four explicit, two implicit and four semi-implicit finite difference algorithms for the linear shape from shading problem. Comparisons of accuracy, solvability, stability and convergence of these schemes indicate that the weighted semi-implicit scheme and the box scheme are better than the other ones because they can be calculated more easily, they are more accu...
متن کامل